Column-Wise Element Selection for Computationally Efficient Nonnegative Coupled Matrix Tensor Factorization

نویسندگان

چکیده

Coupled Matrix Tensor Factorization (CMTF) facilitates the integration and analysis of multiple data sources helps discover meaningful information. Nonnegative CMTF (N-CMTF) has been employed in many applications for identifying latent patterns, prediction, recommendation. However, due to added complexity with coupling between tensor matrix data, existing N-CMTF algorithms exhibit poor computation efficiency. In this paper, a computationally efficient factorization algorithm is presented based on column-wise element selection, preventing frequent gradient updates. Theoretical empirical analyses show that proposed not only more accurate but also than approximating as well underlying nature factors.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative Matrix and Tensor Factorization

T here has been a recent surge of interest in matrix and tensor factorization (decomposition), which provides meaningful latent (hidden) components or features with physical or physiological meaning and interpretation. Nonnegative matrix factorization (NMF) and its extension to three-dimensional (3-D) nonnegative tensor factorization (NTF) attempt to recover hidden nonnegative common structures...

متن کامل

Advances in Nonnegative Matrix and Tensor Factorization

1 Laboratory for Advanced Brain Signal Processing, RIKEN Brain Science Institute, Saitama 351-0198, Japan 2Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800 Lyngby, Denmark 3Advanced Technology Labs, Adobe Systems Inc., 275 Grove Street, Newton, MA 02466, USA 4Centre for Vision, Speech, and Signal Processing, Univer...

متن کامل

Scalable Nonnegative Matrix Factorization with Block-wise Updates

Nonnegative Matrix Factorization (NMF) has been applied with great success to many applications. As NMF is applied to massive datasets such as web-scale dyadic data, it is desirable to leverage a cluster of machines to speed up the factorization. However, it is challenging to efficiently implement NMF in a distributed environment. In this paper, we show that by leveraging a new form of update f...

متن کامل

Algorithms for Nonnegative Tensor Factorization

Nonnegative Matrix Factorization (NMF) is an efficient technique to approximate a large matrix containing only nonnegative elements as a product of two nonnegative matrices of significantly smaller size. The guaranteed nonnegativity of the factors is a distinctive property that other widely used matrix factorization methods do not have. Matrices can also be seen as second-order tensors. For som...

متن کامل

Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization

In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) that are robust in the presence of noise and have many potential applications, including multi-way Blind Source Separation (BSS), multi-sensory or multi-dimensional data analysis, and nonnegative neural sparse coding....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2021

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2020.2967045